New concepts and an algorithm for multiobjective bilevel programming: optimistic, pessimistic and moderate solutions
نویسندگان
چکیده
منابع مشابه
Bilevel Programming Approaches to the Computation of Optimistic and Pessimistic Single-Leader-Multi-Follower Equilibria
We study the problem of computing an equilibrium in leader-follower games with a single leader and multiple followers where, after the leader’s commitment to a mixed strategy, the followers play simultaneously in a noncooperative way, reaching a Nash equilibrium. We tackle the problem from a bilevel programming perspective. Since, given the leader’s strategy, the followers’ subgame may admit mu...
متن کاملNecessary Optimality Conditions in Pessimistic Bilevel Programming Necessary Optimality Conditions in Pessimistic Bilevel Programming
This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipsch...
متن کاملPessimistic and Optimistic Induction
Learning methods vary in the optimism or pessimism with which they regard the informativeness of learned knowledge. Pessimism is implicit in hypothesis testing, where we wish to draw cautious conclusions from experimental evidence. However, this paper demonstrates that optimism in the utility of derived rules may be the preferred bias for learning systems themselves. We examine the continuum be...
متن کاملA goal programming approach for multiobjective linear bilevel programming problems
ABSTRACT: Feasible solutions of Bilevel programming (BLP) problem have to satisfy the optimality conditions of a lower level optimization problem which is defined as part of its constraints. Multiobjective BLP (MOBLP) problems are the special case of BLP problems with multiple objectives at the upper level which require every feasible solution to satisfy the Pareto optimality conditions of a lo...
متن کاملPessimistic bilevel linear optimization
In this paper, we investigate the pessimistic bilevel linear optimization problem (PBLOP). Based on the lower level optimal value function and duality, the PBLOP can be transformed to a single-level while nonconvex and nonsmooth optimization problem. By use of linear optimization duality, we obtain a tractable and equivalent transformation and propose algorithms for computing global or local op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operational Research
سال: 2019
ISSN: 1109-2858,1866-1505
DOI: 10.1007/s12351-019-00534-9